Extensions of Language Families and Canonical Forms for Full AFL-structures∗

نویسنده

  • Peter R.J. Asveld
چکیده

We consider the following ways of extending a family of languages K to an “enriched ” family X(K): (i) hyper-algebraic extension (X = H) based on iterated parallel substitution, (ii) algebraic extension (X = A) obtained by nested iterated substitution, (iii) rational extension (X = R) achieved by not self-embedding nested iterated substitution, and (iv) a few subrational extensions (X = M,C, S, P, F ) based on several kinds of substitution. We introduce full X-AFL’s, i.e., nontrivial families closed under finite substitution, intersection with regular sets and under X, which turn out to be equivalent to well-known full AFL-structures such as full hyperAFL (X = H), full super-AFL (X = A), full substitution-closed AFL (X = R), full semi-AFL (X = S), etc. Then we establish Canonical Forms for the smallest full XAFL X̂ (K) containing K, i.e., we decompose the operator X̂ into simpler operators. Using Canonical Forms for full X-AFL’s we obtain expressions for the smallest full X-AFL containing the result of substituting a family of languages into another family.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An infinite sequence of full AFL-structures, each of which possesses an infinite hierarchy

We investigate different sets of operations on languages which results in corresponding algebraic structures, viz. in different types of full AFL’s (full Abstract Family of Languages). By iterating control on ETOL-systems we show that there exists an infinite sequence Cm (m ≥ 1) of classes of such algebraic structures (full AFL-structures): each class is a proper superset of the next class (Cm ...

متن کامل

Infinite-dimensional versions of the primary, cyclic and Jordan decompositions

The famous primary and cyclic decomposition theorems along with the tightly related rational and Jordan canonical forms are extended to linear spaces of infinite dimensions with counterexamples showing the scope of extensions.

متن کامل

Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data

We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we consider extensions of Petri nets with transfer and reset operations defined for black indistinguishable tokens (Affine Well-Structured Nets), extensions in which tokens carry pure names dynamically generated with special ν-t...

متن کامل

Textual Enhancement across Linguistic Structures: EFL Learners' Acquisition of English Forms

The benefits of textual input enhancement in the acquisition of linguistic forms have produced mixed results in SLA literature. The present study investigates the effects of textual enhancement on adult foreign language intake of two English linguistic forms-subjunctive mood and inversion structures-to explore the role of the type of linguistic items in input enhancement studies. It also invest...

متن کامل

Extended Macro Grammars and Stack Controlled Machines

K-extended basic macro grammars are introduced, where K is any class of languages. The class B(K) of languages generated by such grammars is investigated, together with the class LB(K) of languages generated by the corresponding linear basic grammars. For any full semiAFL K, B(K) is a full AFL closed under iterated LB(K)-substitution, but not necessarily under substitution. For any machine type...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013